Node Importance Ranking and Scaling Properties of some Complex Road Networks
نویسنده
چکیده
The scaling and other quantifiable properties of a network have recently been proven valuable in understanding the robustness and vulnerability properties of various societal and infrastructural networks. In this paper we revisit the algorithms for computing various quantifiable properties of a planar road network and consider the algorithmic complexity and scalability in the light of recent technological advances. We compute properties for a sample of interesting trunk road networks and discuss their applicability in determining the relative importance or criticality to the whole network of a particular node. We discuss the implications of present and anticipated technological capabilities in calculating properties for anticipated network sizes in the light of 64-bit computer architectures and commodity parallel computing.
منابع مشابه
Ranking the Importance of Nodes of Complex Networks by the Equivalence Classes Approach
Identifying the importance of nodes of complex networks is of interest to the research of Social Networks, Biological Networks etc.. Current researchers have proposed several measures or algorithms, such as betweenness, PageRank and HITS etc., to identify the node importance. However, these measures are based on different aspects of properties of nodes, and often conflict with the others. A rea...
متن کاملNode Importance Ranking of Complex Networks with Entropy Variation
The heterogeneous nature of a complex network determines the roles of each node in the network that are quite different. Mechanisms of complex networks such as spreading dynamics, cascading reactions, and network synchronization are highly affected by a tiny fraction of so-called important nodes. Node importance ranking is thus of great theoretical and practical significance. Network entropy is...
متن کاملRange-limited Centrality Measures in Complex Networks
Here we present a range-limited approach to centrality measures in both nonweighted and weighted directed complex networks. We introduce an efficient method that generates for every node and every edge its betweenness centrality based on shortest paths of lengths not longer than ℓ=1,...,L in the case of nonweighted networks, and for weighted networks the corresponding quantities based on minimu...
متن کاملSynchronization analysis of complex dynamical networks with hybrid coupling with application to Chua’s circuit
Complex dynamic networks have been considered by researchers for their applications in modeling and analyzing many engineering issues. These networks are composed of interconnected nodes and exhibit complex behaviors that are resulted from interactions between these nodes. Synchronization, which is the concept of coordinated behavior between nodes, is the most interested behavior in these netwo...
متن کاملImprovement of Coverage Algorithm in WSN in Terms of Sensor Numbers and Power Amount
Wireless sensor networks(WSN) have unique properties that distinguished them from other wireless networks and have special challenges. Not-chargeable, not-changeable and limited power supplies of sensor nodes is the most important challenge of this networks, and if the power supply of node expired, a part of data maybe lost. Because of the importance of covers in wireless sensors, in this work ...
متن کامل